Supercompiler HOSC 1.1: proof of termination
نویسنده
چکیده
The paper contributes the proof of termination of an experimental supercom-piler HOSC dealing with higher-order functions. В работе приводится доказательство завершаемости экпериментального суперкомпилятора HOSC, работающего с функциями высших порядков.
منابع مشابه
Supercompiler HOSC: proof of correctness
The paper presents the proof of correctness of an experimental supercompiler HOSC dealing with higher-order functions. В работе приводится доказательство корректности экспериментального суперкомпилятора HOSC, работающего с функциями высших порядков.
متن کاملKeldysh Institute preprints • Preprint No . 31 , 2010
The paper presents the proof of correctness of an experimental supercompiler HOSC dealing with higher-order functions. В работе приводится доказательство корректности экспериментального суперкомпилятора HOSC, работающего с функциями высших порядков.
متن کاملProperty-based testing and properties as types : a hybrid approach to supercompiler verification
This thesis describes a hybrid approach to compiler verification. Property-based testing and mechanised proof are combined to support the verification of a supercompiler — a particular source-to-source program optimisation. A careful developer may use formal methods to ensure that their program code is correct to specifications. Poorly constructed compilers (and their associated machinery) can ...
متن کاملA Comparison of Program Transformation Systems (meta 2012)
Program transformation is a popular technique for attempting to improve the efficiency of a program. At a high level, program transformation is the process of taking an input program and transforming it into an improved version of the original, bearing the same constraints as the original, e.g. termination constraints. In this paper, we focus on three fold/unfold [3] based transformation system...
متن کاملKELDYSH INSTITUTE OF APPLIED MATHEMATICS Russian Academy of Sciences
TT Lite: a supercompiler for Martin-Löf 's type theory Moscow 2013 Ilya G. Klyuchnikov, Sergei A. Romanenko. TT Lite: a supercom-piler for Martin-Löf 's type-theory The paper describes the design and implementation of a certifying supercom-piler TT Lite, which takes an input program and produces a residual program paired with a proof of the fact that the residual program is equivalent to the in...
متن کامل